𝜀-covering dimension

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

VC Dimension, ε-nets and ε-approximation

“I’ve never touched the hard stuff, only smoked grass a few times with the boys to be polite, and that’s all, though ten is the age when the big guys come around teaching you all sorts to things. But happiness doesn’t mean much to me, I still think life is better. Happiness is a mean son of a bitch and needs to be put in his place. Him and me aren’t on the same team, and I’m cutting him dead. I...

متن کامل

Topological Games and Covering Dimension

We consider a natural way of extending the Lebesgue covering dimension to various classes of infinite dimensional separable metric spaces. All spaces in this paper are assumed to be separable metric spaces. Infinite games can be used in a natural way to define ordinal valued functions on the class of separable metric spaces. One of our examples of such an ordinal function coincides in any finit...

متن کامل

Covering dimension and differential inclusions

In this paper we shall establish a result concerning the covering dimension of a set of the type {x ∈ X : Φ(x)∩Ψ(x) 6= ∅}, where Φ, Ψ are two multifunctions from X into Y and X, Y are real Banach spaces. Moreover, some applications to the differential inclusions will be given.

متن کامل

Covering Dimension and Nonlinear Equations

For a set S in a Banach space, we denote by dim(S) its covering dimension [1, p. 42]. Recall that, when S is a convex set, the covering dimension of S coincides with the algebraic dimension of S, this latter being understood as ∞ if it is not finite [1, p. 57]. Also, S and conv(S) will denote the closure and the convex hull of S, respectively. In [3], we proved what follows. dim({x ∈ X : Φ(x) =...

متن کامل

Covering Numbers , Pseudo - Dimension , and Fat - Shattering Dimension

So far we have seen how to obtain high confidence bounds on the generalization error er D [hS ] of a binary classifier hS learned by an algorithm from a function class H ⊆ {−1, 1}X of limited capacity, using the ideas of uniform convergence. We saw the use of the growth function ΠH(m) to measure the capacity of the class H, as well as the VC-dimension VCdim(H), which provides a one-number summa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1981

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1981.95.257